Small cycle cover of 2-connected cubic graphs
نویسندگان
چکیده
Every 2-connected simple cubic graph of order n¿ 6 has a cycle cover with at most n=4 cycles. This bound is best possible. c © 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Small cycle covers of 3-connected cubic graphs
Every 2-connected simple cubic graph of order n ≥ 6 has a cycle cover with at most dn4 e cycles. This bound is best possible.
متن کاملEven cycle decompositions of 4-regular graphs and line graphs
An even cycle decomposition of a graph is a partition of its edge into even cycles. We first give some results on the existence of even cycle decomposition in general 4-regular graphs, showing that K5 is not the only graph in this class without such a decomposition. Motivated by connections to the cycle double cover conjecture we go on to consider even cycle decompositions of line graphs of 2-c...
متن کاملOrientable embeddings and orientable cycle double covers of projective-planar graphs
In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every 2-connected graph has a closed 2-cell embedding in some orientable surface. This implies both the Cycle Double Cover Conjecture and the Strong Embedding Conjecture. In this paper we prove that every 2-connected proje...
متن کاملDouble covers of cubic graphs with oddness 4
We prove that a cubic 2-connected graph which has a 2-factor containing exactly 4 odd cycles has a cycle double cover. © 2004 Elsevier Inc. All rights reserved. MSC: 05C38; 05C40; 05C70
متن کاملOn Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
The problem of establishing the number of perfect matchings necessary to cover the edge-set of a cubic bridgeless graph is strictly related to a famous conjecture of Berge and Fulkerson. In this paper we prove that deciding whether this number is at most 4 for a given cubic bridgeless graph is NP-complete. We also construct an infinite family F of snarks (cyclically 4-edge-connected cubic graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003